1. Identity statement | |
Reference Type | Conference Paper (Conference Proceedings) |
Site | sibgrapi.sid.inpe.br |
Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
Identifier | 8JMKD3MGPEW34M/45CDUG8 |
Repository | sid.inpe.br/sibgrapi/2021/09.03.12.46 |
Last Update | 2021:09.03.12.46.59 (UTC) administrator |
Metadata Repository | sid.inpe.br/sibgrapi/2021/09.03.12.46.59 |
Metadata Last Update | 2022:06.14.00.00.22 (UTC) administrator |
DOI | 10.1109/SIBGRAPI54419.2021.00014 |
Citation Key | RetondaroEspe:2021:Op2DBa |
Title | Optimized 2D Ball Trees |
Format | On-line |
Year | 2021 |
Access Date | 2024, May 06 |
Number of Files | 1 |
Size | 1712 KiB |
|
2. Context | |
Author | 1 Retondaro, Luis Carlos dos Santos Coutinho Retondaro 2 Esperança, Claudio |
Affiliation | 1 CEFET/RJ - Centro Federal de Educação Tecnológica do Rio de Janeiro 2 Programa de Engenharia de Sistemas e Computação COPPE - Universidade Federal do Rio de Janeiro |
Editor | Paiva, Afonso Menotti, David Baranoski, Gladimir V. G. Proença, Hugo Pedro Junior, Antonio Lopes Apolinario Papa, João Paulo Pagliosa, Paulo dos Santos, Thiago Oliveira e Sá, Asla Medeiros da Silveira, Thiago Lopes Trugillo Brazil, Emilio Vital Ponti, Moacir A. Fernandes, Leandro A. F. Avila, Sandra |
e-Mail Address | luis.retondaro@cefet-rj.br |
Conference Name | Conference on Graphics, Patterns and Images, 34 (SIBGRAPI) |
Conference Location | Gramado, RS, Brazil (virtual) |
Date | 18-22 Oct. 2021 |
Publisher | IEEE Computer Society |
Publisher City | Los Alamitos |
Book Title | Proceedings |
Tertiary Type | Full Paper |
History (UTC) | 2021-09-03 13:14:55 :: luis.retondaro@cefet-rj.br -> administrator :: 2021 2022-03-02 00:54:15 :: administrator -> menottid@gmail.com :: 2021 2022-03-02 13:35:27 :: menottid@gmail.com -> administrator :: 2021 2022-06-14 00:00:22 :: administrator -> :: 2021 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Version Type | finaldraft |
Keywords | ball trees spatial indexing computational geometry |
Abstract | Ball trees are hierarchical bounding structures -- usually binary trees -- where each node consists of a ball (circle, sphere, etc) enclosing its children. Approaches for building an optimal ball tree for a given set of leaves (points or balls enclosing other geometric primitives) typically rely on minimizing some function of the shape of the tree, regardless of the intended application. In this paper we examine the problem of building ball trees for 2D primitives, trying to balance construction time with the efficiency of the produced trees with respect to a set of distance-based queries. In particular, we present three new construction algorithms, propose an optimization whereby each internal node is the smallest ball enclosing all leaves rooted at that node, and describe enhancements to several distance query algorithms. Moreover, an extensive experimental study was conducted in order to evaluate our algorithms with different kinds of data sets, including ball collections that approximate 2D shapes. |
Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2021 > Optimized 2D Ball... |
Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Optimized 2D Ball... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | |
|
4. Conditions of access and use | |
data URL | http://urlib.net/ibi/8JMKD3MGPEW34M/45CDUG8 |
zipped data URL | http://urlib.net/zip/8JMKD3MGPEW34M/45CDUG8 |
Language | en |
Target File | 34.pdf |
User Group | luis.retondaro@cefet-rj.br |
Visibility | shown |
Update Permission | not transferred |
|
5. Allied materials | |
Mirror Repository | sid.inpe.br/banon/2001/03.30.15.38.24 |
Next Higher Units | 8JMKD3MGPEW34M/45PQ3RS 8JMKD3MGPEW34M/4742MCS |
Citing Item List | sid.inpe.br/sibgrapi/2021/11.12.11.46 5 |
Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
|
6. Notes | |
Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |
|